Synthesis of multilevel multiplexer circuits for incompletely specified multioutput Boolean function - Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on

نویسندگان

  • Ingo Schafer
  • Marek A. Perkowski
چکیده

The introduction of the multiplexer-based Actel FPGA series ACT'" resulted in an increased interest in multiplexer circuits. This paper introduces a level-by-level top-down minimization algorithm for them. The concept of a local transform is applied for the generalization of the ratio parameter method for M(1) multiplexer synthesis having one data select input and a spectral method for M ( 2 ) multiplexer synthesis to determine redundant multiplexer inputs for M ( k ) multiplexer circuits. The algorithm developed for multilevel synthesis of M ( k ) multiplexer circuits for incompletely specified multioutput Boolean functions takes advantage of the combination of spectral and Boolean methods. The obtained multiplexer circuit can be directly realized with FPGA's like the Actel ACT series or the CLi 6000 series from Concurrent Logic. A simple heuristic is applied to map an M(1) multiplexer circuit to the Actel ACTl family.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the complexity of minimizing the OBDD size for incompletely specified functions

The problem of constructing an OBDD cover of minimal size for an incompletely specified Boolean function arises in several applications in the CAD domain, e. g. the verification of sequential machines and the construction of OBDDs for incompletely specified circuits. The complexity of this problem is determined. The decision problem is NP–complete. Efficient approximation algorithms exist only ...

متن کامل

Iterative Remapping for Logic Circuits - Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on

This paper presents an aggressive optimization technique targeting combinational logic circuits. Starting from an initial implementation mapped on a given technology library, the network is optimized by finding optimal replacements to clusters of two or more cells at the same time. We leverage a generalized matching algorithm that finds symbolically all possible matching assignments of library ...

متن کامل

Minimization of Exclusive Sum-of-Products Expressions for Multiple-Valued Input, Incompletely Specif - Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on

This paper presents a new operation (exorlink) and an algorithm to minimize Exclusive-OR Sum-of-Products expressions (ESOP’s) for multiple valued input, two valued output, incompletely specified functions. Exorlink is a more powerful operation than any other existing one for this problem. Evaluation on benchmark functions is given and it proves the superiority of the program to those known from...

متن کامل

Sibling-substitution-based BDD minimization using don't cares

In many computer-aided design tools, binary decision diagrams (BDD’s) are used to represent Boolean functions. To increase the efficiency and capability of these tools, many algorithms have been developed to reduce the size of the BDD’s. This paper presents heuristic algorithms to minimize the size of the BDD’s representing incompletely specified functions by intelligently assigning don’t cares...

متن کامل

Logic Synthesis of Multilevel Circuits with Concurrent Error Detection - Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on

This paper presents a procedure for synthesizing multilevel circuits with concurrent error detection. All errors caused by single stuckat faults are detected using a parity-check code. The synthesis procedure (implemented in Stanford CRC’s TOPS synthesis system) fully automates the design process, and reduces the cost of concurrent error detection compared with previous methods. An algorithm fo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004